A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane

نویسندگان

  • Joseph S. B. Mitchell
  • Avrim Blum
  • Prasad Chalasani
  • Santosh Vempala
چکیده

We show that any rectilinear polygonal subdivision in the plane can be converted into a “guillotine” subdivision whose length is at most twice that of the original subdivision. “Guillotine” subdivisions have a simple recursive structure that allows one to search for “optimal” such subdivisions in polynomial time, using dynamic programming. In particular, a consequence of our main theorem is a very simple proof that the k-MST problem in the plane has a constant-factor polynomial-time approximation algorithm: we obtain a factor of 2 (resp., 3) for the L1 metric, and a factor of 2 √ 2 (resp., 3.266) for the L2 (Euclidean) metric in the case in which Steiner points are allowed (resp., not allowed).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems

We present a polynomial time approximation scheme for Euclidean TSP in <2. Given any n nodes in the plane and > 0, the scheme finds a (1 + )-approximation to the optimum traveling salesman tour in time nO(1= ). When the nodes are in <d, the running time increases to nÕ(logd 2 n)= d 1 . The previous best approximation algorithm for the problem (due to Christofides) achieves a 3=2approximation in...

متن کامل

A Constant-Factor Approximation Algorithm for k-MST Problem

Given an undirected graph with nonnegative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the optimum. This improves upon previous performance ratios for this problem &O(k) due to Ravi et al., O(...

متن کامل

A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs

In the (k, λ)-subgraph problem, we are given an undirected graph G = (V, E) with edge costs and two positive integers k and λ and the goal is to find a minimum cost simple λ-edge-connected subgraph of G with at least k nodes. This generalizes several classical problems, such as the minimum cost k-Spanning Tree problem or k-MST (which is a (k, 1)-subgraph), and minimum cost λ-edge-connected span...

متن کامل

A Constant-Factor Approximation Algorithm for the k-MST Problem

Given an undirected graph with non negative edge costs and an inte ger k the k MST problem is that of nding a tree of minimum cost on k nodes This problem is known to be NP hard We present a simple approximation algorithm that nds a solution whose cost is less than times the cost of the optimum This improves upon previous performance ratios for this problem O p k due to Ravi et al O log k due t...

متن کامل

Energy-Efficient Distributed Minimum Spanning Tree Construction: Tight Bounds and Algorithms

Traditionally, the performance of distributed algorithms has been measured in terms of running time and message complexity. However, in many settings, a more accurate and relevant measure of performance is required. In ad hoc wireless networks, energy is a very critical factor for measuring the efficiency of a distributed algorithm. Thus in addition to the traditional time and message complexit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1998